Diagonal Chain Approximation for the torus

نویسنده

  • Mark Powell
چکیده

We write down the chain complex C∗ of the universal cover of the torus, and indicate how to do likewise for any 2-dimensional CW complex arising as the 2-skeleton of a K(G, 1). We exhibit a contracting chain homotopy for this chain complex, and again explain how to do so for the chain complex of the universal cover of our more general CW complex. This yields a contracting homotopy for the tensor product C∗ ⊗ C∗, and formulae of Davis ([2]) allow us to construct a diagonal chain approximation ∆0 : C∗ → C∗ ⊗C∗, close to the diagonal map x 7→ (x, x). Formulae of Trotter ([3]) exist for this, but include the possibility of a 3-cell. In the case of a 2-dimensional group such as Z⊕ Z, the fundamental group of the torus, Trotter’s formulae are unnecessarily long. He remarks that the solution of the word problem is pre-requisite to using the method of contracting chain homotopies; in this case, however, a canonical form for a word is readily available, and so we follow the method through.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Continuous Discrete Variable Optimization of Structures Using Approximation Methods

Optimum design of structures is achieved while the design variables are continuous and discrete. To reduce the computational work involved in the optimization process, all the functions that are expensive to evaluate, are approximated. To approximate these functions, a semi quadratic function is employed. Only the diagonal terms of the Hessian matrix are used and these elements are estimated fr...

متن کامل

Cellular Cochain Algebras and Torus Actions

We prove that the integral cohomology algebra of the moment-angle complex ZK [1] is isomorphic to the Tor-algebra of the face ring of simplicial complex K. The proof relies upon the construction of a cellular approximation of the diagonal map ∆: ZK → ZK × ZK . Cellular cochains do not admit a functorial associative multiplication because a proper cellular diagonal approximation does not exist i...

متن کامل

A Torus Assignment for an Interconnection Network Recursive Diagonal Torus

Recursive Diagonal Torus (RDT) is a class of interconnection network consisting of recursively overlaid twodimensional square diagonal tori for massively parallel computers with up to 2 nodes. Connection structures of the RDT vary according to the assignment of upper rank diagonal tori into a node. Although traditional simple assignment called RDT(2,4,1)/ shows enough performance under the unif...

متن کامل

Investigation of the prevalence of Torus Mandibularis and Torus palatinus in Attendants of rafsanjan Dental school

the prevalence of Torus palatinus and Torus Mandibularis is widely different in various populations and races.this descriptive study was performed in 1999,to investigate the the prevalence of Torus Mandibularis and Torus palatinus in patients referring to Rafsanjan dental school.584 patients(268 men and 316 women) which were over 18 years old were examined.the information recorded in the questi...

متن کامل

Wagner's theorem for Torus graphs

Abstmct. Wagner’s theorem (any two maximal plane graphs having p vertices are equivalent under diagonal transformations) is extended to maximal torus graphs, graphs embedded in the torus with a maximal set of edges present. Thus any maximal torus graph havingp vertices may be diagonally transformed into any other maximal torus p;aph having p vertices. As with Wag mr’s theorem, a normal form rep...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008